Quantum computing without entanglement*1

Quantum computing without entanglement

It is generally believed that entanglement is essential for quantum computing. We present here a few simple examples in which quantum computing without entanglement is better than anything classically achievable, in terms of the reliability of the outcome after a fixed number of oracle calls. Using a separable (that is, unentangled) n-qubit state, we show that the Deutsch-Jozsa problem and the ...

Experimental quantum computing without entanglement.

Deterministic quantum computation with one pure qubit (DQC1) is an efficient model of computation that uses highly mixed states. Unlike pure-state models, its power is not derived from the generation of a large amount of entanglement. Instead it has been proposed that other nonclassical correlations are responsible for the computational speedup, and that these can be captured by the quantum dis...

Quantum Computing without Magic: Devices

Superconducting Quantum Computing without Switches

This paper presents a very simple architecture for a large-scale superconducting quantum computer. All of the SQUID qubits are fixed-coupled to a single large superconducting loop.

Cartoon Computation: Quantum-like computing without quantum mechanics

Diederik Aerts 1 and Marek Czachor 1,2 1 Centrum Leo Apostel (CLEA) and Foundations of the Exact Sciences (FUND) Vrije Universiteit Brussel, 1050 Brussels, Belgium 2 Katedra Fizyki Teoretycznej i Informatyki Kwantowej Politechnika Gdańska, 80-952 Gdańsk, Poland Abstract We present a computational framework based on geometric structures. No quantum mechanics is involved, and yet the algorithms p...